Creating a Self-configuring Finite State Machine out of Memory Look-up Tables

Method of Finite State Machine Optimal Implementation Targeting Look-up-table Architecture

The method of state encoding for finite state machine optimal look-up-table implementation is offered. It is oriented on summary support minimization of logic functions. Encoding length is not restricted (may be non-minimal). As a criterion, the number of Configurable Logic Blocks (CLBs) is considered. Our method includes: 1) seed encoding; 2) step-by-step merging state variables to decrease su...

Higher Order Masking of Look-Up Tables

We describe a new algorithm for masking look-up tables of block-ciphers at any order, as a countermeasure against side-channel attacks. Our technique is a generalization of the classical randomized table countermeasure against first-order attacks. We prove the security of our new algorithm against t-th order attacks in the usual Ishai-Sahai-Wagner model from Crypto 2003; we also improve the bou...

Hierarchical Compression of Color Look Up Tables

Color lookup tables (CLUTs) that are embedded in printer firmware consume precious flash memory. In order to conserve memory and thereby reduce cost, it is desirable to compress CLUTs prior to storage and restore tables as required. In this paper, we investigate methods for lossless compression of CLUTs. We demonstrate that, through suitable pre-processing of data, significant improvements in c...

Digital Look Up Tables and Real Number

Rijndael FPGA Implementations Utilising Look-Up Tables

This paper presents single-chip FPGA Rijndael algorithm implementations of the Advanced Encryption Standard (AES) algorithm, Rijndael. In particular, the designs utilise look-up tables to implement the entire Rijndael Round function. A comparison is provided between these designs and similar existing implementations. Hardware implementations of encryption algorithms prove much faster than equiv...